LobeFinder: A Convex Hull-Based Method for Quantitative Boundary Analyses of Lobed Plant Cells.

نویسندگان

  • Tzu-Ching Wu
  • Samuel A Belteton
  • Jessica Pack
  • Daniel B Szymanski
  • David M Umulis
چکیده

Dicot leaves are composed of a heterogeneous mosaic of jigsaw puzzle piece-shaped pavement cells that vary greatly in size and the complexity of their shape. Given the importance of the epidermis and this particular cell type for leaf expansion, there is a strong need to understand how pavement cells morph from a simple polyhedral shape into highly lobed and interdigitated cells. At present, it is still unclear how and when the patterns of lobing are initiated in pavement cells, and one major technological bottleneck to addressing the problem is the lack of a robust and objective methodology to identify and track lobing events during the transition from simple cell geometry to lobed cells. We developed a convex hull-based algorithm termed LobeFinder to identify lobes, quantify geometric properties, and create a useful graphical output of cell coordinates for further analysis. The algorithm was validated against manually curated images of pavement cells of widely varying sizes and shapes. The ability to objectively count and detect new lobe initiation events provides an improved quantitative framework to analyze mutant phenotypes, detect symmetry-breaking events in time-lapse image data, and quantify the time-dependent correlation between cell shape change and intracellular factors that may play a role in the morphogenesis process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Enhanced Way for Computing Smallest Convex Polygon and Euler Number

A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...

متن کامل

Convex Hull of Grid Points below a Line or a Convex Curve

Consider a nite non-vertical, and non-degenerate straight-line segment s = s0; s1] in the Euclidian plane E 2. We give a method for constructing the boundary of the upper convex hull of all the points with integral coordinates below (or on) s, with abscissa in x(s0); x(s1)]. The algorithm takes O(log n) time, if n is the length of the segment. We next show how to perform a similar construction ...

متن کامل

Rolling-ball Method for Estimating the Boundary of the Support of a Point-process Intensity

We suggest a generalisation of the convex-hull method, or`DEA' approach, for estimating the boundary or frontier of the support of a point cloud. Figuratively, our method involves rolling a ball around the cloud, and using the equilibrium positions of the ball to deene an estimator of the envelope of the point cloud. Constructively, we use these ideas to remove lines from a triangulation of the...

متن کامل

Stratifying High Dimensional Data Based on Proximity to the Convex Hull Boundary

The convex hull of a set of points, C, serves to expose extremal properties of C and can help identify elements in C of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be difficult to determine. One solution is to expand the list of high interest candidates to points lying near the boundary of the convex hull. We propose a quadratic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Plant physiology

دوره 171 4  شماره 

صفحات  -

تاریخ انتشار 2016